Pattern Avoidance and the Bruhat Order on Involutions
نویسندگان
چکیده
We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motzkin paths is demonstrated.
منابع مشابه
Pattern avoidance and Boolean elements in the Bruhat order on involutions
We show that the principal order ideal of an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motzkin...
متن کاملLexicographic shellability of partial involutions
In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographically shellable poset. We determine which subintervals of the Bruhat posets are Eulerian, and moreover, by studying certain embeddings of the symmetric groups and their involutions into rook matrices and partial involu...
متن کاملThe Bruhat Order on the Involutions of the Symmetric Group
In this paper we study the partially ordered set of the involutions of the symmetric group Sn with the order induced by the Bruhat order of Sn . We prove that this is a graded poset, with rank function given by the average of the number of inversions and the number of excedances, and that it is lexicographically shellable, hence Cohen-Macaulay, and Eulerian.
متن کاملThe Bruhat order on conjugation-invariant sets of involutions in the symmetric group
Let In be the set of involutions in the symmetric group Sn, and for A ⊆ {0, 1, . . . , n}, let F n = {σ ∈ In | σ has a fixed points for some a ∈ A}. We give a complete characterisation of the sets A for which F n , with the order induced by the Bruhat order on Sn, is a graded poset. In particular, we prove that F {1} n (i.e., the set of involutions with exactly one fixed point) is graded, which...
متن کاملBruhat Order on Fixed-point-free Involutions in the Symmetric Group
We provide a structural description of Bruhat order on the set F2n of fixed-pointfree involutions in the symmetric group S2n which yields a combinatorial proof of a combinatorial identity that is an expansion of its rank-generating function. The decomposition is accomplished via a natural poset congruence, which yields a new interpretation and proof of a combinatorial identity that counts the n...
متن کامل